partition algorithm造句
例句與造句
- Partition algorithm for key - machine dispatch in job - shop
單件車間關(guān)鍵工序調(diào)度問題的定界算法 - A better partition algorithm is a key to parallel simulation
其中，一個(gè)優(yōu)化的劃分算法是實(shí)現(xiàn)并行模擬的關(guān)鍵。 - Area partitioning algorithm of boolean operations on highly complicated 2d polygons
海量數(shù)據(jù)多邊形布爾運(yùn)算的區(qū)域分割算法 - In this thesis , grid partitioning is converted to an unoriented and weighted graph , on which partitioning algorithm is studied
本文將網(wǎng)格分區(qū)問題轉(zhuǎn)化為無向賦權(quán)圖的分區(qū)，在圖上研究分區(qū)算法。 - It introduces the definition of texture direction . then , it proposes a sorting and partition algorithm of images with directional texture
給出了紋理方向的定義和一個(gè)具有方向性紋理圖像分類和分割算法。 - It's difficult to find partition algorithm in a sentence. 用partition algorithm造句挺難的
- Then , a linear - time partitioning algorithm based on a linear ordering of nodes in a circuit for parallel logic simulation is presented
然后，提出一種在對(duì)電路中節(jié)點(diǎn)進(jìn)行線性排序的基礎(chǔ)上的線性時(shí)間劃分算法。 - Simulation examples to demonstrate the performance of the partitioned algorithms show that the algorithm possesses robustness and high adaptability
仿真實(shí)例表明，分部算法的魯棒性更強(qiáng)，對(duì)系統(tǒng)初值的改變具有更強(qiáng)的適應(yīng)能力。 - Unlike most other partitioning algorithms , the proposed algorithm preserves circuit concurrency by balancing the workload on processors at real time
本文提出的算法很好的解決了這個(gè)問題，保證了模擬過程中各個(gè)處理器上的實(shí)時(shí)負(fù)載平衡，實(shí)現(xiàn)了高度的并行性。 - Experiments show that the new optimized partition algorithm can improve the parallel simulation performance compared with the ones partitioned by traditional graph partition algorithms
實(shí)驗(yàn)表明,該優(yōu)化劃分方法相對(duì)于傳統(tǒng)的圖劃分算法能夠有效地提高模擬性能。 - To solve the problem of rule learning time cost for traditional transformation based part of speech tagging method of latin mongolian , a dynamic partition algorithm was presented
針對(duì)傳統(tǒng)基于轉(zhuǎn)換的詞性標(biāo)注方法中規(guī)則學(xué)習(xí)速度過慢的問題提出了一種對(duì)訓(xùn)練語料庫進(jìn)行動(dòng)態(tài)劃分的算法。 - In chapter 2 , on the basis of reference to classical static priority scheduling theory for hard real - time systems , we proposed a delay computation method with partition algorithm
第二章在借鑒強(qiáng)實(shí)時(shí)系統(tǒng)靜態(tài)優(yōu)先級(jí)調(diào)度理論的基礎(chǔ)上，提出一種通過引入分區(qū)算法來計(jì)算atm交換延遲的方法。 - Partition - compatible data types have the property that two variables , one of each type , with the same value , are mapped to the same partition number by the same partitioning algorithm
分區(qū)兼容的數(shù)據(jù)類型具有如下屬性：具有相同值但有不同類型的兩個(gè)變量會(huì)按相同的分區(qū)算法映射至同一個(gè)分區(qū)號(hào)。 - We suggest the partition algorithms and the reduction algorithms by means of the thoughts of reducing the context scale . by the notions of the formal context base , we implement the algorithms and prove the
本文的目的也就是通過分析概念格的數(shù)學(xué)模型、性質(zhì),對(duì)形式背景進(jìn)行系統(tǒng)的分析探討,為概念格的同構(gòu)構(gòu)造提供理論基礎(chǔ),從而進(jìn)一步將概念格應(yīng)用于數(shù)據(jù)挖掘。 - We have studied how to distill a connection matrix between two nodes in a generalized switched network ; using tarjan ’ s graph partition algorithm and nonseparable two - terminal graph concept , we proposed an effective algorithm
對(duì)從廣義開關(guān)網(wǎng)絡(luò)中提取出兩點(diǎn)間連接矩陣的方法進(jìn)行了研究,利用tarjan的拓?fù)鋱D塊劃分算法、開關(guān)網(wǎng)絡(luò)中的不可分二端圖概念等設(shè)計(jì)了較有效的算法。 - Based on the domain decomposition of parallel computing in fluid dynamics , this thesis is dedicated to the research of automatic partitioning algorithm on unstructured meshes , covering computing theories and their practical application
本文從計(jì)算流體力學(xué)并行計(jì)算的區(qū)域分解方法的背景出發(fā)，研究了非結(jié)構(gòu)網(wǎng)格的自動(dòng)分區(qū)算法，從算法的理論到具體的應(yīng)用作了較為深入的研究。
更多例句： 下一頁